A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse
نویسندگان
چکیده
There exist a number of mathematical problems in the literature concerning warehouse storage optimization. However, to the best of our knowledge the problem of finding optimal slot sizes in pallet rack system minimizing the occupied storage space is not studied. More precisely, the problem is to optimally choose k ofm pallet racks with pallets in a warehouse, find optimal slot sizes in pallet racks for these pallets, and reassign the pallets to the new slots in order to reduce the occupied space maximally. In this paper we suggest a dynamic programming heuristic which finds optimal slot sizes for the given number k of pallet racks in a warehouse. Our computational experiments are based on real-life data and demonstrate the efficiency of the suggested algorithm. c © 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of the Organizing Committee of ITQM 2014.
منابع مشابه
Integrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy
In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...
متن کاملExtracting Dynamics Matrix of Alignment Process for a Gimbaled Inertial Navigation System Using Heuristic Dynamic Programming Method
In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...
متن کاملA Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...
متن کاملOptimizing a bi-objective vendor-managed inventory of multi-product EPQ model for a green supply chain with stochastic constraints
In this paper, a bi-objective multi-product single-vendor single-buyer supply chain problem is studied under green vendor-managed inventory (VMI) policy based on the economic production quantity (EPQ) model. To bring the model closer to real-world supply chain, four constraints of model including backordering cost, number of orders, production budget and warehouse space are considered stochasti...
متن کاملThe optimal warehouse capacity: A queuing-based fuzzy programming approach
Among the various existing models for the warehousing management, the simultaneous use of private and public warehouses is as the most well-known one. The purpose of this article is to develop a queuing theory-based model for determining the optimal capacity of private warehouse in order to minimize the total corresponding costs. In the proposed model, the available space and budget to create a...
متن کامل